منابع مشابه
Relational Graph Rewritings
This note presents a new formalization of graph rewritings which generalizes traditional graph rewritings. Relational notions of graphs and their rewritings are introduced and several properties about graph rewritings are discussed using relational calculus (theory of binary relations). Single pushout approaches to graph rewritings proposed by Raoult and Kennaway are compared with our rewriting...
متن کاملFuzzy Graph Rewritings
This paper presents fuzzy graph rewriting systems with fuzzy relational calculus. In this paper fuzzy graph means crisp set of vetices and fuzzy set of edges. We provide $\mathrm{f}\mathrm{u}\mathrm{z},7,\mathrm{y}$ relational calculus witll Heyting algebra. Formalizing rewriting system of fuzzy graphs it is important to $\mathrm{c}\cdot 1_{1\mathrm{t})\mathrm{t}}.\mathrm{q}\mathrm{C}1$ how to ...
متن کاملLong Rewritings, Short Rewritings
An ontology language L is said to enjoy FO-rewritability if any conjunctive query (CQ) q over any ontology T , given in L, can be transformed into an FOformula q′ such that, for any data A, all answers to q over the knowledge base (T ,A) can be found by querying q′ over A using a standard relational database management system (RDBMS). Ontology languages with this property include the OWL2QL pro...
متن کاملGraph Transformations in Relational Databases
We present a novel approach to implement a graph transformation engine based on standard relational database management systems (RDBMSs). The essence of the approach is to store not only the instance graphs in relational database tables but also keep track explicitly of all the matchings of graph transformation rules in database views. Furthermore, the model manipulation prescribed by the appli...
متن کاملRelational Graph Models at Work
We study the relational graph models that constitute a natural subclass of relational models of λ-calculus. We prove that among the λ-theories induced by such models there exists a minimal one, and that the corresponding relational graph model is very natural and easy to construct. We then study relational graph models that are fully abstract, in the sense that they capture some observational e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00076-u